Trader multiflow and box-TDI systems in series–parallel graphs
نویسندگان
چکیده
منابع مشابه
Monomial Rings of Maximal Cliques of Graphs and Tdi Systems
Let A be an integral matrix whose set of column vectors is A = {v1, . . . , vq} and let A(P ) be the Ehrhart ring of P = conv(A). We are able to show that if A is the incidence matrix of a d-uniform unmixed clutter with covering number g and the system x ≥ 0;xA ≥ 1 is TDI, then the Castelnuovo-Mumford regularity of A(P ) is sharply bounded by (d − 1)(g − 1). Let R = K[x1, . . . , xn] be a polyn...
متن کاملRecognizing conic TDI systems is hard
In this note we prove that the problem of deciding whether or not a set of integer vectors forms a Hilbert basis is co-NP-complete. Equivalently, deciding whether a conic linear system is totally dual integral (TDI) or not, is co-NPcomplete. These are true even if the vectors in the set or respectively the coefficient vectors of the inequalities are 0−1 vectors having at most three ones.
متن کاملRectangle and Box Visibility Graphs in 3D
We discuss rectangle and box visibility representations of graphs in 3-dimensional space. In these representations, vertices are represented by axis-aligned disjoint rectangles or boxes. Two vertices are adjacent if and only if their corresponding boxes see each other along a small axis-parallel cylinder. We concentrate on lower and upper bounds for the size of the largest complete graph that c...
متن کاملMaximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
In this paper, we deal with the maximum integer multiflow and theminimum multicut problems in rectilinear grid graphs with uniformcapacities on the edges. The first problem is known to be NP-hardwhen any vertex can be a terminal, and we show that the second oneis also NP-hard. Then, we study the case where the terminals arelocated in a two-sided way on the boundary of the ou...
متن کاملMulticut and Integral Multiflow in Rings
We show how to solve in polynomial time the multicut and the maximum integral multiflow problems in rings. For the latter problem we generalize an approach proposed by Sai Anand and Erlebach for special cases of the call control problem in ring networks. Moreover, we give linear-time procedures to solve both problems in rings with uniform capacities. keywords. Combinatorial problems, maximum in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2019
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.09.003